Search Strategies for Topological Network Optimization

We consider an application of combinatorial search to the optimization topologies in series-parallel networks. propose a recursive over space decomposition trees, which partial solutions are obtained by exploring k-way partitionings expandable nodes. present two complementary pruning techniques that bound value intermediate from above and below, applying monotonic operations contents unresolved leaves. also develop means exploit convexity our objective function, so as prevent redundant recomputation subcircuit configurations. Finally, we evaluate approach on parameterized benchmark suite electrical circuits, demonstrating order magnitude improvement performance compared baseline implementation.